Fact-based Inter-Process Communication Primitives for Programming Distributed Systems Robbert van Renesse, Department of Computer Science Cornell University Category: Representation The following position paper describes

Source URL: www.cs.cornell.edu

• Concurrent computing
• Computing
• Software engineering
• Fault-tolerant computer systems
• Distributed computing
• Inter-process communication
• Message-oriented middleware
• Publishsubscribe pattern
• Paxos
• Consensus
• Communications protocol
• Distributed algorithm

F2F: reliable storage in open networks Jinyang Li Frank Dabek UC Berkeley/MIT MIT jinyang, fdabek @csail.mit.edu

Source URL: iptps06.cs.ucsb.edu

• Distributed data storage
• Distributed hash table
• Pastry
• Peer-to-peer
• Distributed computing
• Tapestry
• Kademlia

Netbed: An Integrated Experimental Environment Brian White, Shashi Guruprasad, Mac Newbold, Jay Lepreau Leigh Stoller, Robert Ricci, Chad Barb, Mike Hibler, Abhijeet Joglekar School of Computing, University of Utah www.c

Source URL: www.cs.utah.edu

• Computing
• Fault-tolerant computer systems
• Parallel computing
• Computer cluster
• Concurrent computing
• Distributed computing
• Virtualization
• Oracle Clusterware
• IBM RSCT

Awareness about photos on the Web and how privacy-privacy-tradeoffs could help Benjamin Henne and Matthew Smith Distributed Computing & Security Group, Leibniz Universit¨ at Hannover {henne,smith}@dcsec.uni-hannover.de

Source URL: www.dcsec.uni-hannover.de

Exploiting Locality of Interest in Online Social Networks Mike P. Wittie, Veljko Pejovic, Lara Deek, Kevin C. Almeroth, Ben Y. Zhao Department of Computer Science University of California, Santa Barbara {mwittie, veljko,

Source URL: www.cs.ucsb.edu

• Computing
• Network performance
• Computer networking
• Internet privacy
• Distributed data storage
• Telecommunications engineering
• Transmission Control Protocol
• Content delivery network
• Facebook
• Internet
• Server
• DNS hijacking

Unique Aggregate Signatures with Applications to Distributed Verifiable Random Functions? Veronika Kuchta and Mark Manulis Department of Computing, University of Surrey, United Kingdom , mark@manulis

Source URL: manulis.eu

Enforcing Routing Consistency in Structured Peer-to-Peer Overlays: Should We and Could We? Wei Chen and Xuezheng Liu Microsoft Research Asia

Source URL: iptps06.cs.ucsb.edu

• Distributed data storage
• File sharing networks
• Computing
• File sharing
• Key-based routing
• Routing
• Peer-to-peer
• Scalability
• KBR
• Tapestry
• Pastry

Distributed Object Location in a Dynamic Network
Kirsten Hildrum, John D. Kubiatowicz, Satish Rao and Ben Y. Zhao Computer Science Division, University of California at Berkeley hildrum, kubitron, satishr, ravenben@cs

Source URL: www.oceanstore.org

• Distributed data storage
• Computing
• Computer programming
• Concurrent computing
• Tapestry
• Distributed hash table
• Chord
• Pastry
• Routing
• Node
• Tree
• Freenet

ICDCSThe 26th International Conference on Distributed Computing Systems July 4-7, Lisboa, Portugal General Co-Chairs:

Source URL: icdcs2006.di.fc.ul.pt

TRANSACTIONS ON PARALLEL AND DISTRIBUTED COMPUTING, VOL. X, NO. X, SEPTEMBERA Destination-based Approach for Cut Detection in Wireless Sensor Networks

Source URL: faculty.cs.tamu.edu